Chapter 2: Iterative Combinatorial Auctions
نویسنده
چکیده
منابع مشابه
Winner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملEffects of Approximation on an Iterative Combinatorial Auction
HARISH G KAMMANAHALLI. Effects of Approximation on an Iterative Combinatorial Auction. (Under the direction of Dr Ṗeter Wurman.) Combinatorial auctions are a promising way of solving the complicated heterogeneous resource allocation problem. However combinatorial auctions present inherently hard computational problems for agents and auctioneers. In particular (1) the auction must solve the winn...
متن کاملOnline Combinatorial Auctions
This paper explores the feasibility and motivation for online combinatorial auctions. It explains combinatorial auctions and shows an innovative implementation of an iterative combinatorial auction. It then introduces online auctions and highlights some research which bounds the efficiency and revenue comparison to the standard Vickrey auction. Finally, motivations for online combinatorial auct...
متن کاملIndustrial Procurement Auctions
As illustrated in the previous chapters, combinatorial auctions have successfully been applied to various application domains, such as the allocation of airspace system resources (Chapter 20), truckload transportation (Chapter 21) and bus routes (Chapter 22). Industrial procurement is potentially a huge application domain for combinatorial auctions, and it has turned into a topic of interest fo...
متن کاملToward Comprehensive Real-Time Bidder Support in Iterative Combinatorial Auctions
M auctions involve selling several distinct items simultaneously, where bidders can bid on the whole or any part of the lot. Such auctions are referred to as combinatorial auctions. Examples of such auctions include truck delivery routes, industrial procurement, and FCC spectrum. Determining winners in such auctions is an NP-hard problem, and significant research is being conducted in this area...
متن کامل